[FEAT] Implement Dials Algorithm (Graph) #6679
Open
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
Added the Dial's Algorithm implementation (
DialsAlgorithm.java
) to thedatastructures/graphs
package. This algorithm is an efficient optimization of Dijkstra's, making it suitable for specific use cases where edge weights are small non - negative integers.I noticed there are a couple of different directories for graph algorithms. I've placed this implementation in
src/main/java/com/thealgorithms/datastructures/graphs/
However, if you would prefer it in another location (like
src/main/java/com/thealgorithms/graph/
), please let me know, and I would be happy to move it!